Szymon Frankowski PARTIAL AND INTUITIONISTIC LOGIC
نویسنده
چکیده
In the paper we propose a kind of interpretation of partial logic in the intuitionistic logic, or rather its part. We will show that finite binary trees determine this special fragment of intuitionistic logic.
منابع مشابه
François Lepage PARTIAL PROBABILITY FUNCTIONS AND INTUITIONISTIC LOGIC
We first present a sound and complete system of intuitionistic logic augmented with Nelson’s strong negation and interpreted in Kripke’s models’ structure. Then, we show that intuitionistic logic can naturally be interpreted in a modal trivalent logic (propositions are true, false or undefined). Secondly, we introduce a partial probability interpretation, which is inspired by Popper’s condition...
متن کاملThe Generalised Inverse of Intuitionistic Fuzzy Matrices
In this paper, we introduce the concept of generalised inverse (ginverse) for intuitionistic fuzzy matrices (IFMs). We define minus partial ordering and studied several properties of it. Here we have shown that the minus partial ordering is a partial ordering for IFMs.
متن کاملDecidability of Quantified Propositional Intuitionistic Logic and S4 on Trees of Height and Arity ≤ω
Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers ∀p, ∃p, where the propositional variables range over upward-closed subsets of the set of worlds in a Kripke structure. If the permitted accessibility relations are arbitrary partial orders, the resulting logic is known to be recursively isomorphic to full second-order logic (K...
متن کاملDecidability of Quantified Propositional Intuitionistic Logic and S4 on Trees
Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers ∀p, ∃p over propositions. In the context of Kripke semantics, a proposition is a subset of the worlds in a model structure which is upward closed, i.e., if h ∈ P , then h ∈ P for all h ≤ h. For propositional intuitionistic logic H, several classes of model structures are known...
متن کاملAn Intuitionistic Interpretation of Finite and In nite Failure (
In this paper, we propose an intuitionistic semantics for negation-as-failure in logic programs. The basic idea is to work with the completion of the program, not in classical logic, but in intuitionistic (or, more precisely, minimal) logic. Moreover, we consider two forms of completion: (1) rst-order predicate completion, as de ned by Clark, which is related to SLDNF resolution; and (2) second...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011